Non-orientable manifolds of small complexity
نویسندگان
چکیده
We classify all closed non-orientable P-irreducible manifolds having complexity up to 6 and we describe some having complexity 7. We show in particular that there is no such manifold with complexity less than 6, and that those having complexity 6 are precisely the 4 flat non-orientable ones. The manifolds having complexity 7 we describe are Seifert manifolds of type H × S and manifolds with non-trivial JSJ decomposition. MSC (2000): 57M27 (primary), 57M20, 57M50 (secondary).
منابع مشابه
Non-orientable 3-manifolds of small complexity
We classify all closed non-orientable P-irreducible 3-manifolds having complexity up to 6 and we describe some having complexity 7. We show in particular that there is no such manifold with complexity less than 6, and that those having complexity 6 are precisely the 4 flat non-orientable ones and the filling of the Gieseking manifold, which is of type Sol. The manifolds having complexity 7 we d...
متن کاملD ec 2 00 3 Non - orientable 3 - manifolds of complexity up to 7 Gennaro Amendola Bruno Martelli
We classify all closed non-orientable P-irreducible 3-manifolds with complexity up to 7, fixing two mistakes in our previous complexity-up-to-6 classification. We show that there is no such manifold with complexity less than 6, five with complexity 6 (the four flat ones and the filling of the Gieseking manifold, which is of type Sol), and three with complexity 7 (one manifold of type Sol, and t...
متن کاملMinimal 4 - Colored Graphs Representing an Infinite Family of Hyperbolic 3 - Manifolds
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable manifolds (up to graph complexity 32) and for compact orientable 3-manifolds with toric boundary (up to graph complexity 12) and for infinite families of lens spaces...
متن کاملMatveev ’ S Complexity via Crystallization Theory : the Orientable Case ∗
Following the notion of GM-complexity introduced in [8], the present paper performs a graph-theoretical approach to (Matveev’s) complexity computation for closed orientable 3-manifolds. In particular, upper bounds for Matveev’s complexity of closed orientable 3-manifolds triangulated by 28 tetrahedra at most (which are encoded by existing crystallization catalogue C28 due to [17]) are proved to...
متن کاملCompact Hyperbolic 4-manifolds of Small Volume
We prove the existence of a compact non-orientable hyperbolic 4-manifold of volume 32π2/3 and a compact orientable hyperbolic 4-manifold of volume 64π2/3, obtainable from torsion-free subgroups of small index in the Coxeter group [5, 3, 3, 3]. At the time of writing these are the smallest volumes of any known compact hyperbolic 4-manifolds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008